Algorithmic versatility of SPF-regularization methods
نویسندگان
چکیده
منابع مشابه
Algorithmic regularization with velocity-dependent forces
Algorithmic regularization uses a transformation of the equations of motion such that the leapfrog algorithm produces exact trajectories for two-body motion as well as regular results in numerical integration of the motion of strongly interacting few-body systems. That algorithm alone is not sufficiently accurate and one must use the extrapolation method for improved precision. This requires th...
متن کاملFuture - Sequential Regularization Methods
We develop a theoretical context in which to study the future-sequential regularization method developed by J. V. Beck for the Inverse Heat Conduction Problem. In the process, we generalize Beck's ideas and view that method as one in a large class of regularization methods in which the solution of an ill-posed rst-kind Volterra equation is seen to be the limit of a sequence of solutions of well...
متن کاملRegularization Methods for Differential
Many mathematical models arising in science and engineering, including circuit and device simulation in VLSI, constrained mechanical systems in robotics and vehicle simulation, certain models in early vision and incompressible uid ow, lead to computationally challenging problems of di erential equations with constraints, and more particularly to high-index, semi-explicit di erential-algebraic e...
متن کاملArnoldi-Tikhonov regularization methods
Tikhonov regularization for large-scale linear ill-posed problems is commonly implemented by determining a partial Lanczos bidiagonalization of the matrix of the given system of equations. This paper explores the possibility of instead computing a partial Arnoldi decomposition of the given matrix. Computed examples illustrate that this approach may require fewer matrix-vector product evaluation...
متن کاملAlgorithmic Stability 3 4 Regularization Algorithms in an RKHS
In the last few lectures we have seen a number of different generalization error bounds for learning algorithms, using notions such as the growth function and VC dimension; covering numbers, pseudo-dimension, and fatshattering dimension; margins; and Rademacher averages. While these bounds are different in nature and apply in different contexts, a unifying factor that they all share is that tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Analysis and Applications
سال: 2020
ISSN: 0219-5305,1793-6861
DOI: 10.1142/s0219530520400060